Using Euclids Extended Algorithm:
Calculate x and y in Bézout's Identity
using (7,715)
For 2 numbers a and b and divisor d:
ax + by = d
a math | a | b math | b | d math | d | k math | k |
---|---|---|---|---|---|---|---|
Set to 1 | 1 | Set to 0 | 0 | 7 | |||
Set to 0 | 0 | Set to 1 | 1 | 715 | Quotient of 7/715 | 0 | |
1 - (0 x 0) | 1 | 0 - (0 x 1) | 0 | Remainder of 7/715 | 7 | Quotient of 715/7 | 102 |
0 - (102 x 1) | -102 | 1 - (102 x 0) | 1 | Remainder of 715/7 | 1 | Quotient of 7/1 | 7 |
1 - (7 x -102) | 715 | 0 - (7 x 1) | -7 | Remainder of 7/1 | 0 | Quotient of 1/0 | 0 |
a = -102 and b = 1
ax + by = gcd(a,b)
7x + 715y = gcd(7